Branch-Coverage Testability Transformation for Unstructured Programs
نویسندگان
چکیده
منابع مشابه
Branch-Coverage Testability Transformation for Unstructured Programs
Generating test data by hand is a tedious, expensive and error-prone activity, yet testing is a vital part of the development process. Several techniques have been proposed to automate the generation of test data, but all of these are hindered by the presence of unstructured control flow. This paper addresses the problem using testability transformation. Testability transformation does not pres...
متن کاملTestability Transformation - Program Transformation to Improve Testability
Testability transformation is a new form of program transformation in which the goal is not to preserve the standard semantics of the program, but to preserve test sets that are adequate with respect to some chosen test adequacy criterion. The goal is to improve the testing process by transforming a program to one that is more amenable to testing while remaining within the same equivalence clas...
متن کاملApplying Testability Transformations to Achieve Structural Coverage of Erlang Programs
This paper studies the structural testing of Erlang applications. A program transformation is proposed that represents the program under test as a binary tree. The challenge of achieving structural coverage can thus be interpreted as a tree-search procedure. We have developed a testing-technique that takes advantage of this tree-structure, which we demonstrate with respect to a small case study...
متن کاملCo-testability Transformation
This paper introduces the notion of ‘co-testability transformation’. As opposed to traditional testability transformations, which replace the original program in testing, co-testability transformations are designed to be used in conjunction with the original program (and any additional co-transformations as well). Until now, testability transformations have only been used to improve test data g...
متن کاملBytecode Testability Transformation
Bytecode as produced by modern programming languages is well suited for search-based testing: Different languages compile to the same bytecode, bytecode is available also for third party libraries, all predicates are atomic and side-effect free, and instrumentation can be performed without recompilation. However, bytecode is also susceptible to the flag problem; in fact, regular source code sta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 2005
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/bxh093